An Improved Particle Swarm Optimization Algorithm Based on Two Sub-swarms

نویسندگان

  • Zhihui Yu
  • Wenhuan Wu
  • Lieyang Wu
چکیده

In order to improve performance of particle swarm optimization algorithm (PSO) in global optimization, the reason of premature convergence of the PSO is analyzed, and a new particle swarm optimization based on two subswarms (TSS-PSO) is proposed in this paper. The particle swarm is divided into two identical sub-swarms, that is, the first sub-swarm adopts basic PSO model to evolve, whereas the second sub-swarm iterates adopts the cognition only model. In order to enhance the diversity and improve the convergence of the PSO, the worst fitness of the first sub-swarm is exchanged with the best fitness of the second sub-swarm in each iterate for increasing the information exchange between the particles. Compared with other two sub-swarms algorithms, the idea of this algorithm is readily comprehended, and its program is easy to be realized. The experimental results display that the convergence of TSS-PSO evidently gets the advantage of basic particle swarm optimization, as well as its competence of finding the global optimal solution is better than the basic PSO.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Control of Nonlinear Systems using Neuro-Fuzzy Design tuned with Cooperative Particle Sub-Swarms Optimization

This paper proposes a TSK-type Neuro-Fuzzy system tuned with a novel learning algorithm. The proposed algorithm used an improved version of the standard Particle Swarm Optimization algorithm, it employs several sub-swarms to explore the search space more efficiently. Each particle in a sub-swarm correct her position based on the best other positions, and the useful information is exchanged amon...

متن کامل

Symbiotic Multi-swarm PSO for Portfolio Optimization

This paper presents a novel symbiotic multi-swarm particle swarm optimization (SMPSO) based on our previous proposed multi-swarm cooperative particle swarm optimization. In SMPSO, the population is divided into several identical sub-swarms and a center communication strategy is used to transfer the information among all the sub-swarms. The information sharing among all the sub-swarms can help t...

متن کامل

An improved particle swarm optimization for feature selection

Particle Swarm Optimization (PSO) is a popular and bionic algorithm based on the social behavior associated with bird flocking for optimization problems. To maintain the diversity of swarms, a few studies of multi-swarm strategy have been reported. However, the competition among swarms, reservation or destruction of a swarm, has not been considered further. In this paper, we formulate four rule...

متن کامل

A New Shuffled Sub-swarm Particle Swarm Optimization Algorithm for Speech Enhancement

In this paper, we propose a novel algorithm to enhance the noisy speech in the framework of dual-channel speech enhancement. The new method is a hybrid optimization algorithm, which employs the  combination of  the  conventional θ-PSO and the shuffled sub-swarms particle optimization (SSPSO) technique. It is known that the θ-PSO algorithm has better optimization performance than standard PSO al...

متن کامل

Particle Swarm Optimization based on Multiple Swarms and Opposition-based Learning*

Standard particle swarm optimization is easy to fall into local optimum and has the problem of low precision. To solve these problems, the paper proposes an effective approach, called particle swarm optimization based on multiple swarms and opposition-based learning, which divides swarm into two subswarms. The 1st sub-swarm employs PSO evolution model in order to hold the self-learning ability;...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012